Armstrong's Axioms and Navigation Strategies

نویسندگان

  • Kaya Deuser
  • Pavel Naumov
چکیده

The paper investigates navigability with imperfect information. It shows that the properties of navigability with perfect recall are exactly those captured by Armstrong’s axioms from database theory. If the assumption of perfect recall is omitted, then Armstrong’s transitivity axiom is not valid, but it can be replaced by a weaker principle. The main technical results are soundness and completeness theorems for the logical systems describing properties of navigability with and without perfect recall.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Common Knowledge Semantics of Armstrong's Axioms

Armstrong’s axioms were originally proposed to describe functional dependency between sets of attributes in relational databases. The database semantics of these axioms can be easily rephrased in terms of distributed knowledge in multi-agent systems. The paper proposes alternative semantics of the same axioms in terms of common knowledge. The main technical result of this work is soundness and ...

متن کامل

Author’s response to reviews Title: Implementation strategies to improve cervical cancer prevention in sub-Saharan Africa: a systematic review Authors:

Title: Implementation strategies to improve cervical cancer prevention in sub-Saharan Africa: a systematic review Authors: Lauren Johnson ([email protected]) Allison Armstrong ([email protected]) Caroline Joyce ([email protected]) Anne Teitelman ([email protected]) Alison Buttenheim ([email protected]) Version: 1 Date: 22 Nov 2017 Author’s response to reviews: ...

متن کامل

Extracting Knowledge from Incomplete Data

Decision-makers are often met with situations where optimal decisions have to be made in the presence of missing information. To facilitate such work we propose application of Armstrong axioms. Key–Words: Decision support systems, uncertainty management, inference axioms

متن کامل

Modelling an Automatic Proof Generator for Functional Dependency Rules Using Colored Petri Net

Database administrators need to compute closure of functional dependencies (FDs) for normalization of database systems and enforcing integrity rules. Colored Petri net (CPN) is a powerful formal method for modelling and verification of various systems. In this paper, we modelled Armstrong's axioms for automatic proof generation of a new FD rule from initial FD rules using CPN. For this purpose,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1707.04106  شماره 

صفحات  -

تاریخ انتشار 2017